Heuristic algorithms for scheduling on uniform parallel machines with heads and tails

نویسندگان

  • Kai Li
  • Shanlin Yang
چکیده

This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion time. For this NP-hard problem, the largest sum of release date, processing time and delivery time first rule is designed to determine a certain machine for each job, and the largest difference between delivery time and release date first rule is designed to sequence the jobs scheduled on the same machine, and then a novel algorithm for the scheduling problem is built. To evaluate the performance of the proposed algorithm, a lower bound for the problem is proposed. The accuracy of the proposed algorithm is tested based on the data with problem size varying from 200 jobs to 600 jobs. The computational results indicate that the average relative error between the proposed algorithm and the lower bound is only 0.667%, therefore the solutions obtained by the proposed algorithm are very accurate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two meta-heuristic algorithms for parallel machines scheduling problem with past-sequence-dependent setup times and effects of deterioration and learning

This paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. In addition, the setup time of a job on each machin...

متن کامل

Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

متن کامل

An approximate decomposition algorithm for scheduling on parallel machines with heads and tails

We address the makespan minimization for parallel identical machines subject to heads and tails. This problem is NP-hard in the strong sense. We show that the worst-case performance of Jackson’s algorithm is improved by using a preprocessing algorithm, and we propose an approximate decomposition algorithm which requires iteratively solving a sequence of two-machine problems. We present the resu...

متن کامل

Finite Horizon Economic Lot and Delivery Scheduling Problem: Flexible Flow Lines with Unrelated Parallel Machines and Sequence Dependent Setups

This paper considers the economic lot and delivery scheduling problem in a two-echelon supply chains, where a single supplier produces multiple components on a flexible flow line (FFL) and delivers them directly to an assembly facility (AF). The objective is to determine a cyclic schedule that minimizes the sum of transportation, setup and inventory holding costs per unit time without shortage....

متن کامل

Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011